R. Dechter, Constraint Processing, Morgan Kaufmann (2003)

نویسنده

  • Roman Barták
چکیده

Constraint satisfaction is a relatively young research area of Artificial Intelligence addressing combinatorial optimization problems. Until recent years, there were only a few books describing the topic so it was not easy for newcomers to get in and to understand the techniques behind constraint satisfaction. This situation hindered education in the area so the community did not grow and develop as much as it could. It also led and still leads to many misunderstandings about constraint satisfaction techniques; the most embarrassing one is putting equality between constraint satisfaction and simple enumeration. The book Constraint Processing by Rina Dechter with contributions from David Cohen, Peter Jeavons, and Francesca Rossi is a welcome introduction to the field of constraint satisfaction that will help researchers, educators, and students understand what constraint processing is about. It is a comprehensive book that can be used as a companion for courses on constraint satisfaction especially because the reader does not need to be an expert in the area to understand the text. The introductory character of the book makes it easy to read; nevertheless advanced students and researchers may also find deeper information on some topics there. Rina Dechter is an excellent researcher with contributions in many areas of constraint satisfaction and this is reflected in the book in both good and bad sense. Let us now go through the contents of the book in more detail. The main text is split into basic and advanced parts; navigation through the contents is simplified by a chapter flow diagram. A very nice feature is a unified structure of all chapters. After the main text in a chapter there is always a summary, bibliographical notes, and exercises. That is great for those that want to scan briefly the contents of the chapter before deciding to read it or that want to continue in deeper studies of the topic. Exercises will surely be welcomed by teachers. Chapter 1 is a standard book introduction describing the basic concepts of constraint satisfaction including some examples and giving mathematical background necessary for reading of the text. The basics of sets, graphs, and complexity theory are explained there

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CONSTRAINT Networks

1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...

متن کامل

Reformulating R(*, m)C with Tree Decomposition

Local consistency properties and algorithms for enforcing them are central to the success of Constraint Processing. Recently, we have demonstrated the importance of higher levels of consistency and the effectiveness of their algorithms for solving difficult problems (Karakashian et al. 2010; Woodward et al. 2011). In this paper, we introduce two reformulation techniques for improving the effect...

متن کامل

Knowledge representation and commonsense reasoning: Reviews of four books

Ronald J. Brachman, Hector J. Levesque, Knowledge Representation and Reasoning, Morgan Kaufmann, ISBN 1558609326, 2004, 381 pages. Raymond Reiter, Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems, MIT Press, ISBN 0262182181, 2001, 448 pages. Erik T. Mueller, Commonsense Reasoning, Morgan Kaufmann, ISBN 0123693888, 2006, 432 pages. Chitta Baral, Knowledg...

متن کامل

Improving Backtrack Search for Solving the TCSP

In this paper, we address the task of finding the minimal network of a Temporal Constraint Satisfaction Problem (TCSP). We report the integration of three approaches to improve the performance of the exponential-time backtrack search (BT-TCSP) proposed by Dechter et al. [6] for this purpose. The first approach consists of using a new efficient algorithm ( STP) [21] for solving the Simple Tempor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 169  شماره 

صفحات  -

تاریخ انتشار 2005